An Algorithm Based on Self-balancing Binary Search Tree to Generate Balanced, Intra-homogeneous and Inter-homogeneous Learning Groups

The universal homogeneous binary tree

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable semilinear order which is dense, unbounded, binary branching, and without joins, which we denote by (S2;≤). We study the reducts of (S2;≤), that is, the relational structures with domain S2, all of whos...

The effects of homogeneous small groups on the efficacy of problem-based learning

Introduction: Problem-based learning (PBL) as a learning style has gained a special position amongst different levels of education systems, and many different approaches, such as tutor education, proper scenario presentation, etc., are used to increase its efficiency. However, the role of homogeneous groups to facilitate team working has never been studied. The purpose of this study is to exami...

An Algorithm to Generate Neighbor Balanced Binary Block Designs

Ahmed and Akhtar (2007) developed some algorithms to generate neighbor balanced designs. Here, a new algorithm is developed to generate circular neighbor balanced binary block designs for v = 2k in 2(v-1) blocks when blocks are well separated. A catalogue of circular neighbor balanced binary block designs for v up to 50 is presented.

the effects of homogeneous small groups on the efficacy of problem-based learning

introduction: problem-based learning (pbl) as a learning style has gained a special position amongst different levels of education systems, and many different approaches, such as tutor education, proper scenario presentation, etc., are used to increase its efficiency. however, the role of homogeneous groups to facilitate team working has never been studied. the purpose of this study is to exami...

A New Weight Balanced Binary Search Tree